Generating pairs for finite index subgroups of SL(n,Z)
نویسندگان
چکیده
منابع مشابه
Counting Finite Index Subgroups
Let F be a finitely generated group. Denote by an(T) (resp.<rn(r)) the number of subgroups of F of index n (resp. of index at most n). This paper deals with the connection between the algebraic structure of the group F and the arithmetic properties of the sequence an(F), n — 1,2,3,..., e.g., the growth of the sequence an(T) ("the subgroup growth") or the properties of the function Cr(s) = X2£Li...
متن کاملFinite index subgroups of mapping class groups
Let g ≥ 3 and n ≥ 0, and let Mg,n be the mapping class group of a surface of genus g with n boundary components. We prove that Mg,n contains a unique subgroup of index 2g−1(2g − 1) up to conjugation, a unique subgroup of index 2g−1(2g + 1) up to conjugation, and the other proper subgroups ofMg,n are of index greater than 2g−1(2g+1). In particular, the minimum index for a proper subgroup of Mg,n...
متن کاملSubgroups of Finite Index in Profinite Groups
One way to view Theorem 1.1 is as a statement that the algebraic structure of a finitely generated profinite group somehow also encodes the topological structure. That is, if one wishes to know the open subgroups of a profinite group G, a topological property, one must only consider the subgroups of G of finite index, an algebraic property. As profinite groups are compact topological spaces, an...
متن کاملFinite Index Subgroups of Conjugacy Separable Groups
We construct an example of conjugacy separable group possessing a not conjugacy separable subgroup of finite index. We give also a sufficient condition for a conjugacy separable group to preserve this property when passing to subgroups of finite index. We establish also conjugacy separability of finitely presented residually free groups using impressive results of Bridson and Wilton [BW-07].
متن کاملOn finite-index extensions of subgroups of free groups
We study the lattice of finite-index extensions of a given finitely generated subgroup H of a free group F . This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of H . This characterization leads to a fast algorithm to compute the commensurator, which is based on a standard algorithm from automata theory. We also give a sub-exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2017
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2016.09.026